Cyclic AFD algorithm for the best rational approximation
نویسندگان
چکیده
منابع مشابه
Cyclic AFD Algorithm for Best Rational Approximation
We propose a practical algorithm of best rational approximation of a given order to a function in the Hardy H space on the unit circle or on the real line. The type approximation is proved to be equivalent with Blaschke form approximation. The algorithm is called Cyclic AFD as it adaptively selects one parameter during each cycle based on the Maximal Selection Principle used in adaptive Fourier...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملa method to obtain the best uniform polynomial approximation for the family of rational function
in this article, by using chebyshev’s polynomials and chebyshev’s expansion, we obtain the best uniform polynomial approximation out of p2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in the Applied Sciences
سال: 2013
ISSN: 0170-4214
DOI: 10.1002/mma.2843